Proceedings ( preliminary version ) 10 th International Workshop on Coalgebraic Methods in Computer Science
نویسندگان
چکیده
Solutions of recursive program schemes over a given signature Σ were characterized by Bruno Courcelle as precisely the context-free (or algebraic) Σ-trees. These are the finite and infinite Σ-trees yielding, via labelling of paths, context-free languages. Our aim is to generalize this to finitary endofunctors H of general categories: we construct a monad C “generated” by solutions of recursive program schemes of type H, and prove that this monad is ideal. In case of polynomial endofunctors of Set our construction precisely yields the monad of context-free Σ-trees of Courcelle. Our result builds on a result by N. Ghani et al on solutions of algebraic systems.
منابع مشابه
SEN - 1004 ) 10 th International Workshop on Coalgebraic Methods in Computer Science
The powerset construction is a standard method for converting a non-deterministic automaton into an equivalent deterministic one as far as language is concerned. In this short paper, we lift the powerset construction on automata to the more general framework of coalgebras with enriched state spaces. Examples of applications includes transducers, and Rabin probabilistic automata.
متن کاملPreliminary Proceedings 13 th International Workshop on Expressiveness in Concurrency EXPRESS ’ 06 Bonn , Germany 26 August 2006 Editors : Roberto Amadio
We give an overview over recent work on fairness in reactive and concurrent systems, including an abstract characterisation of fairness. We also derive a notion of a fairly correct system and sketch its application.
متن کاملProceedings of the 5 th International Workshop on Critical Systems Development Using Modeling Languages ( CSDUML 2006 )
The proceedings present the accepted contributions for the 5 International Workshop on Critical Systems Development Using Modeling Languages (CSDUML’06). CSDUML’06 takes place on October 1, 2006, in Genova, Italy, and is organised in conjunction with MoDELS’06 (October 1 – 6, 2006). The papers represent research in four areas: specification and analysis, system synthesis, verification, and indu...
متن کامل10 th International Workshop on Coalgebraic Methods in Computer Science
Solutions of recursive program schemes over a given signature Σ were characterized by Bruno Courcelle as precisely the context-free (or algebraic) Σ-trees. These are the finite and infinite Σ-trees yielding, via labelling of paths, context-free languages. Our aim is to generalize this to finitary endofunctors H of general categories: we construct a monad C “generated” by solutions of recursive ...
متن کاملConvergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)
Citation for published version (APA): Bahr, P. (2013). Convergence in infinitary term graph rewriting systems is simple (extended abstract). In R. Echahed, & D. Plump (Eds.), Proceedings of the 7th International Workshop on Computing with Terms and Graphs: Rome, 23th March 2013 (pp. 17-28). Open Publishing Association. Electronic Proceedings in Theoretical Computer Science, Vol.. 110, DOI: 10.4...
متن کامل